Deterministic Permutation Routing on Meshes
نویسندگان
چکیده
New deterministic algorithms for routing permutations on two-dimensional meshes are developed. On an n n array, one of them runs in the optimal 2 n ? 2 steps. It has maximum queue length 32. Another algorithm runs in near-optimal time, 2 n + O(1) steps, with a maximum queue length of only 12.
منابع مشابه
Permutation Routing and Sorting on Meshes with Row and Column Buses
We study the problems of permutation routing and sorting on several models of meshes with xed and reconngurable row and column buses. We describe two fast and fairly simple deterministic algorithms for permutation routing on two-dimensional networks, and a more complicated algorithm for multi-dimensional networks. The algorithms are obtained by converting two known oo-line routing schemes into ...
متن کاملRouting and Sorting on Meshes with Row and Column Buses
We give improved deterministic algorithms for permutation routing and sorting on meshes with row and column buses. Among our results, we obtain a fairly simple algorithm for permutation routing on two-dimensional meshes with buses that achieves a running time of n + o(n) and a queue size of 2. We also describe an algorithm for routing on r-dimensional networks with a running time of (2? 1=r)n+ ...
متن کاملPermutation Routing on Mesh model Parallel Computers
This paper studies the problems of permutation routing on different mesh models of parallel computation and simulates algorithms for different mesh models using C. Simple algorithms for permutation routing mesh models with and without bus have been considered, analyzed and simulated. In mesh models with bus, models with fixed bus and reconfigurable buses are dealt. For problems in permutation r...
متن کاملShorter Queues for Permutation Routing on Meshes
New deterministic algorithms for routing permutations on an n n MIMD mesh are presented. They are very eecient in terms of the size of auxiliary memory at each processor, measured as the maximum number of packets that need to be queued. One algorithm runs in the optimal time 2 n ? 2 with a maximum queue length of 33. Another runs in the near-optimal time 2 n + O(1) with a maximum queue length o...
متن کاملBetter Deterministic Routing on Meshes
Optimal randomized and deterministic algorithms have been given for k-k routing on two-dimensional n n meshes. The deterministic algorithm is based on “column-sort” and exploits only part of the features of the mesh. For small n and moderate k, the lower-order terms of this algorithm make it considerably more expensive than the randomized algorithm. In this paper, we present a novel determinist...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1993